Hierarchical Adaptive Pooling by Capturing High-Order Dependency for Graph Representation Learning

نویسندگان

چکیده

Graph neural networks (GNN) have been proven to be mature enough for handling graph-structured data on node-level graph representation learning tasks. However, the pooling technique expressive graph-level is critical yet still challenging. Existing methods either struggle capture local substructure or fail effectively utilize high-order dependency, thus diminishing expression capability. In this paper we propose HAP, a hierarchical framework, which adaptively sensitive structures, i.e., HAP clusters substructures incorporating with dependencies. utilizes novel cross-level attention mechanism MOA naturally focus more close neighborhood while higher-order dependency that may contain crucial information. It also learns global content GCont extracts pattern properties make pre- and post-coarsening maintain stable, providing guidance in coarsening. This innovation facilitates generalization across graphs same form of features. Extensive experiments ten datasets show significantly outperforms twelve popular classification task an maximum accuracy improvement 20.18%, exceeds performance state-of-the-art matching similarity algorithms by over 3.42% 16%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-order Graph-based Neural Dependency Parsing

In this work, we present a novel way of using neural network for graph-based dependency parsing, which fits the neural network into a simple probabilistic model and can be furthermore generalized to high-order parsing. Instead of the sparse features used in traditional methods, we utilize distributed dense feature representations for neural network, which give better feature representations. Th...

متن کامل

Differentiable Pooling for Hierarchical Feature Learning

We introduce a parametric form of pooling, based on a Gaussian, which can be optimized alongside the features in a single global objective function. By contrast, existing pooling schemes are based on heuristics (e.g. local maximum) and have no clear link to the cost function of the model. Furthermore, the variables of the Gaussian explicitly store location information, distinct from the appeara...

متن کامل

Capturing Temporal Sequences for Text Representation Using Hierarchical SOMs

This paper explores a new representation for text document by using an unsupervised learning mechanism – a hierarchical structure of Self-Organizing Feature Maps. This architecture is based on a code-book model. Through this architecture, a document can be encoded to a sequence of neurons while the temporal sequences of words as well as their frequencies are kept. Our results show that this arc...

متن کامل

Video Representation Learning Using Discriminative Pooling

Popular deep models for action recognition in videos generate independent predictions for short clips, which are then pooled heuristically to assign an action label to the full video segment. As not all frames may characterize the underlying action—indeed, many are common across multiple actions—pooling schemes that impose equal importance on all frames might be unfavorable. In an attempt to ta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2023

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2021.3133646